hyperarithmetical theory造句
例句与造句
- It includes the study of lightface pointclasses, and is closely related to hyperarithmetical theory.
- An alternate classification of these sets by way of iterated computable functionals is provided by hyperarithmetical theory.
- Hyperarithmetical theory is the special case in which & alpha; is \ omega ^ { CK } _ 1.
- Hyperarithmetical theory is generalized by & alpha;-recursion theory, which is the study of definable subsets of admissible ordinals.
- It includes the study of computability in higher types as well as areas such as hyperarithmetical theory and & alpha;-recursion theory.
- It's difficult to find hyperarithmetical theory in a sentence. 用hyperarithmetical theory造句挺难的
- Hyperarithmetical theory studies those sets that can be computed from a computable ordinal number of iterates of the Turing jump of the empty set.
- The area of effective descriptive set theory combines the methods of descriptive set theory with those of generalized recursion theory ( especially hyperarithmetical theory ).
- There are three equivalent ways of defining this class of sets; the study of the relationships between these different definitions is one motivation for the study of hyperarithmetical theory.
- The existence of any recursive ordinal that the theory fails to prove is well ordered follows from the \ Sigma ^ 1 _ 1 bounding theorem, as the set of natural numbers that an effective theory proves to be ordinal notations is a \ Sigma ^ 0 _ 1 set ( see Hyperarithmetical theory ).